Symmetric Schröder paths and restricted involutions

نویسندگان

  • Eva Yu-Ping Deng
  • Mark Dukes
  • Toufik Mansour
  • Susan Y. J. Wu
چکیده

Let Ak be the set of permutations in the symmetric group Sk with prefix 12. This paper concerns the enumeration of involutions which avoid the set of patterns Ak. We present a bijection between symmetric Schröder paths of length 2n and involutions of length n + 1 avoiding A4. Statistics such as the number of right-to-left maxima and fixed points of the involution correspond to the number of steps in the symmetric Schröder path of a particular type. For each k ≥ 3 we determine the generating function for the number of involutions avoiding the subsequences in Ak, according to length, first entry and number of fixed points.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Involutions Avoiding the Class of Permutations

An involution π is said to be τ -avoiding if it does not contain any subsequence having all the same pairwise comparisons as τ . This paper concerns the enumeration of involutions which avoid a set Ak of subsequences increasing both in number and in length at the same time. Let Ak be the set of all the permutations 12π3 . . . πk of length k. For k = 3 the only subsequence in Ak is 123 and the 1...

متن کامل

Involutions avoiding the class of permutations in S k with prefix 12

An involution π is said to be τ -avoiding if it does not contain any subsequence having all the same pairwise comparisons as τ . This paper concerns the enumeration of involutions which avoid a set Ak of subsequences increasing both in number and in length at the same time. Let Ak be the set of all the permutations 12π3 . . . πk of length k. For k = 3 the only subsequence in Ak is 123 and the 1...

متن کامل

The butterfly decomposition of plane trees

We introduce the notion of doubly rooted plane trees and give a decomposition of these trees, called the butterfly decomposition which turns out to have many applications. From the butterfly decomposition we obtain a oneto-one correspondence between doubly rooted plane trees and free Dyck paths, which implies a simple derivation of a relation between the Catalan numbers and the central binomial...

متن کامل

From (2, 3)-Motzkin Paths to Schröder Paths

In this paper, we provide a bijection between the set of restricted (2, 3)-Motzkin paths of length n and the set of Schröder paths of semilength n. Furthermore, we give a one-to-one correspondence between the set of (2, 3)-Motzkin paths of length n and the set of little Schröder paths of semilength n + 1. By applying the bijections, we get the enumerations of Schröder paths according to the sta...

متن کامل

Pattern avoidance and Boolean elements in the Bruhat order on involutions

We show that the principal order ideal of an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are also stated. Involutions with this property are enumerated with respect to natural statistics. In this context, a bijective correspondence with certain Motzkin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 309  شماره 

صفحات  -

تاریخ انتشار 2009